#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
    int jewelleryValue(vector<vector<int>>& frame) {
        int n = frame.size();
        int m = frame[0].size();
        if (frame.empty() || frame[0].empty())return 0;
        vector<vector<int>>dp(n, vector<int>(m, 0));
        dp[0][0] = frame[0][0];
        for (int i = 1; i < n; i++) {
            dp[i][0] = dp[i - 1][0] + frame[i][0];
        }
        for (int i = 1; i < m; i++) {
            dp[0][i] = dp[0][i - 1] + frame[0][i];
        }
        for (int i = 1; i < n; i++) {
            for (int j = 1; j < m; j++) {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + frame[i][j];
            }
        }
        return dp[n - 1][m - 1];
    }
};